Induction Based on Rippling and Proof Planning
نویسنده
چکیده
I n p u t : ( g r o u n d ) c o n u e n t s e t R , e q u a t i o n s L , e q u a t i o n s C .
منابع مشابه
The Representation of the Rippling Heuristic in Proof Planning Using Coloured Annotations
The Rippling heuristic developed by the Mathematical Reasoning Group in the Dept of Artiicial Intelligence, Edinburgh is a proven method of reducing the search space for a proof by induction through the use of annotated rewrite rules in the induction step case. Rippling is one of the 'methods' of the Clam proof planning system, which is used by both students and researchers. The diiculty of und...
متن کاملOrdinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
This paper reports a case study in the use of proof planning in the context of higher order syntax. Rippling is a heuristic for guiding rewriting steps in induction that has been used successfully in the proof planning inductive of proofs using first order representations. Ordinal arithmetic provides a natural set of higher order examples on which transfinite induction may be attempted using ri...
متن کاملEqualizing Terms by Diierence Reduction Techniques
In the eld of inductive theorem proving syntactical diierences between the induction hypothesis and induction conclusion are used in order to guide the proof BvHS91, Hut90, Hut]. This method of guiding induction proofs is called rippling / coloring terms and there is considerable evidence of its success on practical examples. For equality reasoning we use these annotated terms to represent synt...
متن کاملEqualising Terms by Diierence Reduction Techniques
In the eld of inductive theorem proving syntactical diierences between the induction hypothesis and induction conclusion are used in order to guide the proof BvHS91, Hut90, Hut]. This method of guiding induction proofs is called rippling / coloring terms and there is considerable evidence of its success on practical examples. For equality reasoning we use these annotated terms to represent synt...
متن کاملA proof planning framework for Isabelle
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to guide the proof process. The idea is to capture common patterns of reasoning which can be used to derive abstract descriptions of proofs known as proof plans. These can then be executed to provide fully formal proofs. This thesis concerns the development and analysis of a novel approach to proof pl...
متن کامل